Solution Equivalent Subquadrangle Reformulations of Constraint Satisfaction Problems
نویسندگان
چکیده
Subquadrangles are a natural way in which to represent constraints as they do not restrict any subset of their scope. There are already known methods for converting any given constraint into a set of subquadrangles, but we require a method by which an entire constraint satisfaction problem instance can be converted as a whole. In this paper we present two methods by which we might decompose a given instance into a solution equivalent instance whose constraints are all subquadrangles.
منابع مشابه
Interchangeability Supports Abstraction and Reformulation for Multi-Dimensional Constraint Satisfaction
Interchangeability provides a principled approach to abstraction and reformulation of constraint satisfaction problems. Values are interchangeable if exchanging one for the other in any solution produces another solution. Abstracting a problem by simplifying the constraints can increase interchangeability. Multi-dimensional constraint satisfaction problems can provide natural opportunities for ...
متن کاملfor Multi - Dimensional Constraint Satisfaction
Interchangeability provides a principled approach to abstraction and reformulation of constraint satisfaction problems. Values are interchangeable if exchanging one for the other in any solution produces another solution. Abstracting a problem by simplifying the constraints can increase interchangeability. Multi-dimensional constraint satisfaction problems can provide natural opportunities for ...
متن کاملA New Approach on Solving 3-Satisfiability
In this paper we describe and analyse an algorithm for solving the 3-satissability problem. If clauses are regarded as constraints of Constraint Satisfaction Problems, then every clause presents a constraint with a special property, namely subquadrangle. We show that the algorithm on subquadrangles guarantees a solution in time less than O(1:476 n), which improves the current well-known 3-satis...
متن کاملA Search Control for Scheduling Problems
We propose a framework to control the search for solutions by relaxation, reduction , and decomposition of scheduling problems. Scheduling problems are regarded as Constraint Satisfaction Problems (CSPs) which are represented by sets of constraints. We introduce the notion of subquadrangle and show how to represent any constraint by intersections and unions of subquadrangles. This allows us to ...
متن کاملOn Reformulating Planning as Dynamic Constraint Satisfaction (extended Abstract)
In recent years, researchers have reformulated STRIPS planning problems as SAT problems or CSPs. In this paper, we discuss the Constraint-Based Interval Planning (CBIP) paradigm, which can represent planning problems incorporating interval time and resources. We describe how to reformulate mutual exclusion constraints for a CBIP-based system, the Extendible Uniform Remote Operations Planner Arc...
متن کامل